Primitive normal polynomials over finite fields
نویسندگان
چکیده
منابع مشابه
Search of Primitive Polynomials over Finite Fields
Let us introduce some notations and definitions: if p denotes a prime integer and n a positive integer, then GF(p”) is the field containing pn elements. a primitive element of GF(p”) is a generator of the cyclic multiplicative group GVP”)*, a manic irreducible polynomial of degree n belonging to GF(p)[X] is called primitive if its roots are primitive elements of GF(p”). These polynomials are in...
متن کاملThe coefficients of primitive polynomials over finite fields
For n ≥ 7, we prove that there always exists a primitive polynomial of degree n over a finite field Fq (q odd) with the first and second coefficients prescribed in advance.
متن کاملp-ADIC FORMAL SERIES AND PRIMITIVE POLYNOMIALS OVER FINITE FIELDS
In this paper, we investigate the Hansen-Mullen conjecture with the help of some formal series similar to the Artin-Hasse exponential series over p-adic number fields and the estimates of character sums over Galois rings. Given n we prove, for large enough q, the Hansen-Mullen conjecture that there exists a primitive polynomial f(x) = xn − a1xn−1 + · · ·+ (−1)an over Fq of degree n with the m-t...
متن کاملNormal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملIrreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1994
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1994-1257578-3